The Turing Degrees below generics and randoms
نویسنده
چکیده
If x0 and x1 are both generic, the theories of the degrees below x0 and x1 are the same. The same is true if both are random. We show that the n-genericity or n-randomness of x do not su¢ ce to guarantee that the degrees below x have these common theories. We also show that these two theories (for generics and randoms) are di¤erent. These results answer questions of Jockusch as well as Barmpalias, Day and Lewis.
منابع مشابه
Degrees that Are Low for Isomorphism
We say that a degree is low for isomorphism if, whenever it can compute an isomorphism between a pair of computable structures, there is already a computable isomorphism between them. We show that while there is no clear-cut relationship between this property and other properties related to computational weakness, the low-forisomorphism degrees contain all Cohen 2-generics and are disjoint from...
متن کاملSome improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملGenerics for computable Mathias forcing
We study the complexity of generic reals for computable Mathias forcing in the context of computability theory. The n-generics and weak ngenerics form a strict hierarchy under Turing reducibility, as in the case of Cohen forcing. We analyze the complexity of the Mathias forcing relation, and show that if G is any n-generic with n ≥ 3 then it satisfies the jump property G(n−1) ≡T G′ ⊕ ∅(n). We p...
متن کاملExtensions of Embeddings below Computably Enumerable Degrees
Toward establishing the decidability of the two quantifier theory of the ∆ 2 Turing degrees with join, we study extensions of embeddings of upper-semi-lattices into the initial segments of Turing degrees determined by computably enumerable sets, in particular the degree of the halting set 0. We obtain a good deal of sufficient and necessary conditions.
متن کاملThe enumeration degrees: Local and global structural interactions
We show that the structure of the enumeration degrees De has a finite automorphism base consisting of finitely many total elements below the first jump of its least element. As a consequence we obtain that the rigidity of the structure of the enumeration degrees is implied by the rigidity of the local structures of the Σ2 enumeration degrees, the ∆ 0 2 Turing degrees and the computably enumerab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Log.
دوره 79 شماره
صفحات -
تاریخ انتشار 2014